Safe Reduction Rules for Weighted Treewidth
نویسندگان
چکیده
منابع مشابه
Safe separators for treewidth
A set of vertices S ⊆ V is called a safe separator for treewidth, if S is a separator of G, and the treewidth of G equals the maximum of the treewidth over all connected components W of G S of the graph, obtained by making S a clique in the subgraph of G, induced by W ∪ S. We show tha t such safe separators are a very powerful tool for preprocessing graphs when we want to compute their treewidt...
متن کاملKernelization Rules for Special Treewidth and Spaghetti Treewidth
Using the framework of kernelization we study whether efficient preprocessing schemes for the Special Treewidth problem can give provable bounds on the size of the processed instances. In this paper it is shown that Special Treewidth has a kernel with O(`) vertices, where ` denotes the size of a vertex cover. This implies that given an instance (G, k) of Special Treewidth we can efficiently red...
متن کاملReduction Algorithms for Graphs of Small Treewidth
This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. Arnborg et al. [2] have shown that many decision problems on graphs can be solved in linear time on graphs of bounded treewidth, by using a finite set of reduction rules. These algorithms can be used to solve problems on graphs of bounded treewidth without the need to first obtain a ...
متن کاملTreewidth reduction for the parameterized Multicut problem
The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is Fixed-Parameter Tractable with respect to k is one of the most important open question in parameterized complexity [5]. We show that Multicut...
متن کاملWeighted quadrature rules with binomial nodes
In this paper, a new class of a weighted quadrature rule is represented as -------------------------------------------- where is a weight function, are interpolation nodes, are the corresponding weight coefficients and denotes the error term. The general form of interpolation nodes are considered as that and we obtain the explicit expressions of the coefficients using the q-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-006-1226-x